The Minimum Monopoly Distance Energy of a Graph
نویسندگان
چکیده
منابع مشابه
The Minimum Monopoly Distance Energy of a Graph
In a graph G = (V,E), a set M ⊆ V is called a monopoly set of G if every vertex v ∈ V −M has at least d(v) 2 neighbors in M . The monopoly size mo(G) of G is the minimum cardinality of a monopoly set among all monopoly sets in G. In this paper, the minimum monopoly distance energy EMd(G) of a connected graphG is introduced and minimum monopoly distance energies of some standard graphs are compu...
متن کاملThe Minimum Distance of Graph Codes
We study codes constructed from graphs where the code symbols are associated with the edges and the symbols connected to a given vertex are restricted to be codewords in a component code. In particular we treat such codes from bipartite expander graphs coming from Euclidean planes and other geometries. We give results on the minimum distances of the codes.
متن کاملSome results on the energy of the minimum dominating distance signless Laplacian matrix assigned to graphs
Let G be a simple connected graph. The transmission of any vertex v of a graph G is defined as the sum of distances of a vertex v from all other vertices in a graph G. Then the distance signless Laplacian matrix of G is defined as D^{Q}(G)=D(G)+Tr(G), where D(G) denotes the distance matrix of graphs and Tr(G) is the diagonal matrix of vertex transmissions of G. For a given minimum dominating se...
متن کاملThe Minimum Distance Energy for Polygonal Unknots
This paper investigates the energy UMD of polygonal unknots. It provides equations for finding the energy for any planar regular n-gon and for any m-gon, where the vertices lie on the vertices of a regular m 2 -gon and on the midpoints of each edge. In addition, we show that a regular 4-gon minimizes the energy for any quadrilateral. Finally, this paper includes a proof showing that if we have ...
متن کاملMinimum-distance bounds by graph analysis
The parity-check matrix of a linear code is used to define a bipartite code constraint (Tanner) graph in which bit nodes are connected to parity check nodes. The connectivity properties of this graph are analyzed using both local connectivity and the eigenvalues of the associated adjacency matrix. A simple lower bound on minimum distance of the code is expressed in terms of the two largest eige...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Computer Applications
سال: 2015
ISSN: 0975-8887
DOI: 10.5120/ijca2015906457